Watching Clauses in Quantified Boolean Formulae
نویسنده
چکیده
The introduction of watched literals[1], a lazy data structure for satisfiability (SAT) search algorithms, has resulted in great improvements in the run-time of SAT solvers. Watched literals keeps track of two literals remaining in a clause so as to detect when a clause becomes unit or empty. Watched literals is non-trivial to implement in QBF search. Quantified Boolean Formulae (QBFs) are SAT formulae with some variables universally quantified. This changes the semantics of unit and false clauses. The issue of watching literals in QBF is addressed in [2]. In this paper, I show that the use of lazy data structures need not be restricted to literals in clauses. In SAT, the detection of pure literals and deleted variables appears to be unimportant[3], and so watched literals has so far been the only implemented lazy data structure. In search for QBF satisfiability, this is not the case; the detection of universal pure literals in particular is critical. This is because a universal pure literal is set false, and so removes the universal from clauses. These clauses could then lead to further unit propagation. To detect a pure literal, one must know the number of literals of each sign of a variable that exist in the problem. An easy way in which to do this is to keep a list of which clauses a variable occurs in an which sign the literal of the variable has in those clauses. If the positive and negative occurences are kept separate, detecting pure literals becomes trivial. The watched method improves upon this by keeping one positive and one negative watched “c-literal” per variable. If either is ever removed and no other can be found to take its place, the variable is detected as having a pure literal. In an experimental comparison, the watched clause method outperformed the standard method by up to 8825 times on some problems, and never performed worse. The watched clause method is not restricted to QBF and implementation in SAT may prove the effectiveness of pure literals in SAT.
منابع مشابه
Boolean Propagation Based on Literals for Quantified Boolean Formulae
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated automatically thanks to quantified Boolean formulae certificates. Different decompositions by introduction of existentially quantified variables are discussed in order to construct complete systems. This set of rules is compared with already proposed quantified Boolean propagation ...
متن کاملTowards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at least) k out of n propositional variables or formulae are true. We present a unifying framework for a whole family of such encodings encompassing previously proposed solutions. We give two novel encodings that improv...
متن کاملVivifying Propositional Clausal Formulae
In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and relevant clauses. More precisely, an incomplete redundancy check is performed on each original clauses through...
متن کاملSymmetry Breaking in Quantified Boolean Formulae
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting such symmetries has been proved to be very important in reducing search efforts. Breaking symmetries using additional constraints is currently one of the most used approaches. Extending such symmetry breaking techniques to quantified boolean formulae (QBF) is a very challenging task. In this paper, an approach to brea...
متن کامل#2,2-sat Is Solvable in Linear-time
A linear-time algorithm, with respect to the size of the instance Boolean formula, is presented for the #SAT problem restricted to formulae of the form #2; 2-CF, i.e. formulae whose clauses have just two literals and in which each variable appears at most twice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003